Internet traffic engineering without full mesh overlaying - INFOCOM 2001. Proceedings. IEEE
نویسندگان
چکیده
The overlay approach has been widely used by many service providers for traffic engineering in large Internet backbones. In the overlay approach, logical connections are set up between edge nodes to form a full mesh virtual network on top of the physical topology. IP routing is then run over the virtual network. Traffic engineering objectives are achieved through carefully routing logical connections over the physical links. Although the overlay approach has been implemented in many operational networks, it has a number of well-known scaling issues. This paper proposes a new approach, which we call the integrated approach, to achieve traffic engineering without full-mesh overlaying. In the integrated approach, IP routing runs natively over the physical topology rather than over the virtual network. Traffic engineering objectives are realized by setting appropriate link metrics in IP routing protocols. We first illustrate our approach with a simple network, then present a formal analysis of the integrated approach and a method for deriving the appropriate link weights. Our analysis shows that for any given set of optimal routes of the overlayapproach with respect to a set of traffic demands, the integrated approach can achieve exactly the same result by reproducing them as shortest paths. We further extend the result to a more generic one: for any arbitrary set of routes, as long as they are not loopy, they can be converted to shortest-paths with respect to some set of positive link weights. A theoretical insight of our result is that the optimal routing (with respect to any objective function) is always shortest path routing with respect to some appropriate positive link weights. Keywords—Traffic engineering, performance optimization, IP routing, Linear Programming.
منابع مشابه
Internet Traffic Engineering without Full Mesh Overlaying
The overlay approach has been widely used by many service providers for traffic engineering in large Internet backbones. In the overlay approach, logical connections are set up between edge nodes to form a full mesh virtual network on top of the physical topology. IP routing is then run over the virtual network. Traffic engineering objectives are achieved through carefully routing logical conne...
متن کاملIntegrated Subset Split for Balancing Network Utilization and Quality of Routing
The overlay approach has been widely used by many service providers for Traffic Engineering (TE) in large Internet backbones. In the overlay approach, logical connections are set up between edge nodes to form a full mesh virtual network on top of the physical topology. IP routing is then run over the virtual network. Traffic engineering objectives are achieved through carefully routing logical ...
متن کاملDifferentiation mechanisms for IEEE 802.11 - INFOCOM 2001. Proceedings. IEEE
The IETF is currently working on service differentiation in the Internet. However, in wireless environments where bandwidth is scarce and channel conditions are variable, IP differentiated services are suboptimal without lower layers’ support. In this paper we present three service differentiation schemes for IEEE 802.11. The first one is based on scaling the contention window according to the ...
متن کاملInterworking wireless mesh networks: Problems, performance characterization, and perspectives
Wireless broadband networks based on the IEEE 802.11 technology are being increasingly deployed as mesh networks to provide users with extended coverage for wireless Internet access. These wireless mesh networks, however, may be deployed by different authorities without any coordination a priori, and hence it is possible that they overlap partially or even entirely in service area, resulting in...
متن کاملEdge-based traffic engineering for OSPF networks
This paper proposes and evaluates a novel, edge-based approach, which we call the kset Traffic Engineering (TE) method, to perform traffic engineering in OSPF networks by partitioning traffic into uneven k traffic sets. The traffic partitioning and splitting takes place only at network edges, leaving the core simple. We theoretically prove that if k is large enough, the k-set TE method achieves...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001